Delegate and Conquer: An LP-Based Approximation Algorithm for Minimum Degree MSTs
نویسندگان
چکیده
In this paper, we study the minimum degree minimum spanning tree problem: Given a graph G = (V, E) and a non-negative cost function c on the edges, the objective is to find a minimum cost spanning tree T under the cost function c such that the maximum degree of any node in T is minimized. We obtain an algorithm which returns an MST of maximum degree at most ∆∗+k where ∆∗ is the minimum maximum degree of any MST and k is the distinct number of costs in any MST of G. We use a lower bound given by a linear programming relaxation to the problem and strengthen known graph-theoretic results on minimum degree subgraphs [3, 5] to prove our result. Previous results for the problem [1, 4] used a combinatorial lower bound which is weaker than the LP bound we use.
منابع مشابه
Low-Degree Minimum Spanning Trees
Motivated by practical VLSI routing applications, we study the maximum vertex degree of a minimum spanning tree (MST). We prove that under the Lp norm, the maximum vertex degree over all MSTs is equal to the Hadwiger number of the corresponding unit ball; we show an even tighter bound for MSTs where the maximum degree is minimized. We give the best-known bounds for the maximum MST degree for ar...
متن کاملReliable Designing of Capacitated Logistics Network with Multi Configuration Structure under Disruptions: A Hybrid Heuristic Based Sample Average Approximation Algorithm
We consider the reliable multi configuration capacitated logistics network design problem (RMCLNDP) with system disruptions, concerned with facilities locating, transportation links constructing, and also allocating their limited capacities to the customers in order to satisfy their demands with a minimum expected total cost (including locating costs, link constructing costs, as well as expecte...
متن کاملFast Approximate Minimum Spanning Tree Algorithm Based on K-Means
It is difficult to apply traditional Minimum spanning tree(MST) algorithms to a large dataset since the time complexity of the algorithms is quadratic. In this paper, we present a fast approximate MST framework on the complete graph of N points, and any exact MST algorithm can be incorporated into the framework and speeded up. The proposed framework employs a divide-and-conquer scheme to produc...
متن کاملDC-Based Approximations on Graphs
We now return to the one basic design paradigm we skipped in our discussion of approximation algorithms for NP-hard optimization problems, namely divide-and-conquer (DC), and apply it to problems on graphs. The basic idea is as follows: Find a balanced cut of small capacity, i.e., a cut in which both sides contain roughly the same number of vertices and such that few edges cross the cut. Ignore...
متن کاملA Push-Relabel Algorithm for Approximating Degree Bounded MSTs
Given a graph G and degree bound B on its nodes, the bounded-degree minimum spanning tree (BDMST) problem is to find a minimum cost spanning tree among the spanning trees with maximum degree B. This bi-criteria optimization problem generalizes several combinatorial problems, including the Traveling Salesman Path Problem (TSPP). An (α, f(B))-approximation algorithm for the BDMST problem produces...
متن کامل